Beyond the Turing Test

نویسنده

  • José Hernández-Orallo
چکیده

The main factor of intelligence is defined as the ability to comprehend, formalising this ability with the help of new constructs based on descriptional complexity. The result is a comprehension test, or C-test, which is exclusively defined in computational terms. Due to its absolute and non-anthropomorphic character, it is equally applicable to both humans and non-humans. Moreover, it correlates with classical psychometric tests, thus establishing the first firm connection between information theoretical notions and traditional IQ tests. The Turing Test is compared with the C-test and the combination of the two is questioned. In consequence, the idea of using the Turing Test as a practical test of intelligence should be surpassed, and substituted by computational and factorial tests of different cognitive abilities, a much more useful approach for artificial intelligence progress and for many other intriguing questions that present themselves beyond the Turing Test.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Beyond the Turing Test ( Extended , original internal report )

We define the main factor of intelligence as the ability to comprehend, formalising this ability with the help of new constructs based on descriptional complexity. The result is a comprehension test, or C-test, exclusively defined in terms of universal descriptional machines (e.g universal Turing machines). Despite the absolute and non-anthropomorphic character of the test it is equally applica...

متن کامل

Beyond Turing Machines

This paper discusses ”computational” systems capable of ”computing” functions not computable by predefined Turing machines if the systems are not isolated from their environment. Roughly speaking, these systems can change their finite descriptions by interacting with

متن کامل

Non-Classical Hypercomputation

Hypercomputation that seeks to solve the Halting Problem, or to compute Turing-uncomputable numbers, might be called “classical” hypercomputation, as it moves beyond the classical Turing computational paradigm. There are further computational paradigms that we might seek to move beyond, forming the basis for a wider “non-classical” hypercomputation. This paper surveys those paradigms, and poses...

متن کامل

A Hypercomputation in Brouwer's Constructivism

In contrast to other constructivist schools, for Brouwer, the notion of “constructive object” is not restricted to be presented as ‘words’ in some finite alphabet of symbols, and choice sequences which are non-predetermined and unfinished objects are legitimate constructive objects. In this way, Brouwer’s constructivism goes beyond Turing computability. Further, in 1999, the term hypercomputati...

متن کامل

Are Minds Computable?

This essay explores the limits of Turing machines concerning the modeling of minds and suggests alternatives to go beyond those limits.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Logic, Language and Information

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2000